Exceptional scatteredness in prime degree
نویسندگان
چکیده
Let q be an odd prime power and n integer. ??Fqn[x] a q-linearized t-scattered polynomial of linearized degree r. d=max?{t,r} number. In this paper we show that under these assumptions it follows ?=x. Our technique involves Galois theoretical characterization polynomials combined with the classification transitive subgroups general linear group over finite field Fq.
منابع مشابه
Degree spectra of prime models
We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomi...
متن کاملA characterization of the symmetric group of prime degree
Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $Gcong S_p$ if and only if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$, whe...
متن کاملPrime models of computably enumerable degree
We examine the computably enumerable (c.e.) degrees of prime models of complete atomic decidable (CAD) theories. A structure has degree d if d is the degree of its elementary diagram. We show that if a CAD theory T has a prime model of c.e. degree c, then T has a prime model of strictly lower c.e. degree b, where, in addition, b is low (b′ = 0′). This extends Csima’s result that every CAD theor...
متن کاملNorm-euclidean Cyclic Fields of Prime Degree
Let K be a cyclic number field of prime degree `. Heilbronn showed that for a given ` there are only finitely many such fields that are normEuclidean. In the case of ` = 2 all such norm-Euclidean fields have been identified, but for ` 6= 2, little else is known. We give the first upper bounds on the discriminants of such fields when ` > 2. Our methods lead to a simple algorithm which allows one...
متن کاملRoots of Solvable Polynomials of Prime Degree
An explicit formula for the most general root of a solvable polynomial of prime degree is stated and proved. Such a root can be expressed rationally in terms of a single compound radical determined by the roots of a cyclic polynomial whose degree divides μ − 1, where μ is the prime. The study of such formulas was initiated by a formula of Abel for roots of quintic polynomials that are solvable,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2021
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2020.09.034